Polyhedral truncations as eutactic transformations.

نویسندگان

  • M Torres
  • J L Aragón
  • A Gómez-Rodríguez
چکیده

An eutactic star is a set of N vectors in Rn (N > n) that are projections of N orthogonal vectors in RN. First introduced in the context of regular polytopes, eutactic stars are particularly useful in the field of quasicrystals where a method to generate quasiperiodic tilings is by projecting higher-dimensional lattices. Here are defined the concepts of eutactic transformations (as mappings that preserve eutacticity) and of vector radiations (vectors that stem from the vectors of an eutactic star), which are used to describe and parameterize polyhedral truncations. The polyhedral truncations preserve eutacticity, a result of relevance to the faceting and habit-forming characteristics of quasicrystals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Putting Polyhedral Loop Transformations to Work

We seek to extend the scope and efficiency of iterative compilation techniques by searching not only for program transformation parameters but for the most appropriate transformations themselves. For that purpose, we need to find a generic way to express program transformations and compositions of transformations. In this article, we introduce a framework for the polyhedral representation of a ...

متن کامل

Oil and Water can mix! Experiences with integrating Polyhedral and AST-based Transformations

The polyhedral model is an algebraic framework for affine program representations and transformations for enhancing locality and parallelism. Compared with traditional AST-based transformation frameworks, the polyhedral model can easily handle imperfectly nested loops and complex data dependences within and across loop nests in a unified framework. On the other hand, AST-based transformation fr...

متن کامل

Polyhedral Abstract Interpretation

The polyhedral model is a collection of techniques developed around a common intermediate representation of programs : integer polyhedra. Such a mathematical representation of programs inherits nice structural properties. For instance, when loop transformations are represented as affine functions, compositions of transformations are also affine functions due to their closure properties. The pol...

متن کامل

Set and Relation Manipulation for the Sparse Polyhedral Framework

The Sparse Polyhedral Framework (SPF) extends the Polyhedral Model by using the uninterpreted function call abstraction for the compile-time specification of run-time reordering transformations such as loop and data reordering and sparse tiling approaches that schedule irregular sets of iteration across loops. The Polyhedral Model represents sets of iteration points in imperfectly nested loops ...

متن کامل

Polyhedral Transformations of Explicitly Parallel Programs

The polyhedral model is a powerful algebraic framework that has enabled significant advances to analyses and transformations of sequential affine (sub)programs, relative to traditional AST-based approaches. However, given the rapid growth of parallel software, there is a need for increased experiences with using polyhedral frameworks for analysis and transformations of explicitly parallel progr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Acta crystallographica. Section A, Foundations of crystallography

دوره 60 Pt 4  شماره 

صفحات  -

تاریخ انتشار 2004